The Sat Problem of Signed Cnf Formulas
نویسندگان
چکیده
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalised notion of literal, called signed literal. A signed literal is an expression of the form S : p, where p is a classical atom and S, its sign, is a subset of a domain N . The informal meaning is “p takes one of the values in S”. Signed formulas are a logical language for knowledge representation that lies in the intersection of the areas constraint programming (CP), many-valued logic (MVL), and annotated logic programming (ALP). This central rôle of signed CNF justifies a detailed study of its subclasses including algorithms for and complexities of associated satisfiability problems (SAT problems). Although signed logic is used since the 1960s, there are only few systematic investigations of its properties. In contrast to work done in ALP and MVL, our present work is a more fine-grained study for the case of propositional CNF. We highlight the most interesting lines of current research: (i) signed versions of some main proponents of
منابع مشابه
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the form S : p, where p is a classical atom and S, its sign, is a subset of a domain N . The informal meaning is “p takes one of the values in S”. Applications for deduction in signed logics derive from those of annotated...
متن کاملResolution and Clause-Learning with Restarts for Signed CNF Formulas
Motivated by the question of how to e ciently do model finding or theorem proving for multi-valued logics, we study the relative reasoning power of resolution proofs and a natural family of model-finding algorithms for Signed CNF Formulas. The conflict-driven clause learning (CDCL) algorithm for SAT is the basis of model finding software systems (SAT solvers) that have impressive performance on...
متن کاملResolution and Clause Learning for Multi-Valued CNF Formulas
Conflict-directed clause learning (CDCL) is the basis of SAT solvers with impressive performance on many problems. CDCL with restarts (CDCL-R) has been shown to have essentially the same reasoning power as unrestricted resolution (formally, they p-Simulate each other). We show that this property generalizes to multi-valued CNF formulas. In particular, for Signed (or Multi-Valued) CNF formulas, ...
متن کاملThe Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas
Recent universal-hashing based approaches to sampling and counting crucially depend on the runtime performance of SAT solvers on formulas expressed as the conjunction of both CNF constraints and variable-width XOR constraints (known as CNF-XOR formulas). In this paper, we present the first study of the runtime behavior of SAT solvers equipped with XOR-reasoning techniques on random CNF-XOR form...
متن کاملMAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time
We give an exact deterministic algorithm for MAX-SAT. On input CNF formulas with constant clause density (the ratio of the number of clauses to the number of variables is a constant), this algorithm runs in O(c) time where c < 2 and n is the number of variables. Worst-case upper bounds for MAX-SAT less than O(2) were previously known only for k-CNF formulas and for CNF formulas with small claus...
متن کامل